The generating polynomial and Euler characteristic of intersection graphs
نویسندگان
چکیده
منابع مشابه
The generating polynomial and Euler characteristic of intersection graphs
Let E” be n-dimensional Euclidean space. A molecular space is a family of unit cubes in E”. Any molecular space can be represented by its intersection graph. Conversely, it is known that any graph G can be represented by molecular space M(G) in E” for some n. Suppose that S, and S, are topologically equivalent surfaces in E” and molecular spaces M, and M, are the two families of unit cubes inte...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملChordal graphs and the characteristic polynomial
A characteristic polynomial was recently de!ned for greedoids, generalizing the notion for matroids. When chordal graphs are viewed as antimatroids by shelling of simplicial vertices, the greedoid characteristic polynomial gives additional information about those graphs. In particular, the characteristic polynomial for a chordal graph is an alternating clique generating function and is expressi...
متن کاملComputing the Characteristic Polynomial of Threshold Graphs
We present an algorithm for constructing the characteristic polynomial of a threshold graph’s adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe. It can be implemented using O(n) space and with running time O(n). Submitted: December 2013 Reviewed: October 2014 Revised: November 2014 Accepted: December 2014 Final: December 2014 Published: December 20...
متن کاملThe Euler characteristic as a polynomial in the Chern classes
In this paper we obtain some explicit expressions for the Euler characteristic of a rank n coherent sheaf F on P and of its twists F(t) as polynomials in the Chern classes ci(F), also giving algorithms for the computation. The employed methods use techniques of umbral calculus involving symmetric functions and Stirling numbers. Introduction The aim of this paper is to find a general polynomial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90393-x